Multi-vehicle routing problems with soft time windows: A multi-agent reinforcement learning approach
نویسندگان
چکیده
منابع مشابه
A multi-criteria vehicle routing problem with soft time windows by simulated annealing
This paper presents a multi-criteria vehicle routing problem with soft time windows (VRPSTW) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. In this case, the fleet is heterogene-ous. The VRPSTW consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. It is assumed that this relaxation a...
متن کاملa multi-criteria vehicle routing problem with soft time windows by simulated annealing
this paper presents a multi-criteria vehicle routing problem with soft time windows (vrpstw) to mini-mize fleet cost, routes cost, and violation of soft time windows penalty. in this case, the fleet is heterogene-ous. the vrpstw consists of a number of constraints in which vehicles are allowed to serve customers out of the desirable time window by a penalty. it is assumed that this relaxation a...
متن کاملA goal programming model for vehicle routing problem with backhauls and soft time windows
The vehicle routing problem with backhauls (VRPB) as an extension of the classical vehicle routing prob-lem (VRP) attempts to define a set of routes which services both linehaul customers whom product are to be delivered and backhaul customers whom goods need to be collected. A primary objective for the problem usually is minimizing the total distribution cost. Most real-life problems have othe...
متن کاملMulti-Objective Vehicle Routing Problems with Time Windows: A Vector Evaluated Artificial Bee Colony Approach
The vehicle routing problem with time windows, widely used in practice, is an NP-hard problem. This paper presents a new meta-heuristic algorithm for solving the problem. Unlike traditional two-steps algorithms, the proposed optimization algorithm, based on the artificial bee colony algorithm combined with the vector evaluated technique, solves the problem as a multi-objective problem. As a res...
متن کاملSolving Homogeneous Reinforcement Learning Problems with a Multi-Agent Approach
In this paper we examine reinforcement learning problems which consist of a set of homogeneous entities. These problems tend to have extremely large state spaces making standard approaches unattractive. We study lane change selection in a car traffic control problem as an example of such a problem. We show how a single agent problem can be translated into an approximating multi-agent problem. W...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transportation Research Part C: Emerging Technologies
سال: 2020
ISSN: 0968-090X
DOI: 10.1016/j.trc.2020.102861